Monte-Carlo Planning for Pathfinding in Real-Time Strategy Games
نویسندگان
چکیده
In this work, we explore two Monte-Carlo planning approaches: Upper Confidence Tree (UCT) and Rapidlyexploring Random Tree (RRT). These Monte-Carlo planning approaches are applied in a real-time strategy game for solving the path finding problem. The planners are evaluated using a grid-based representation of our game world. The results show that the UCT planner solves the path planning problem with significantly less search effort than the RRT planner. The game playing performance of each planner is evaluated using the mean, maximum and minimum scores in the test games. With respect to the mean scores, the RRT planner shows better performance than the UCT planner. The RRT planner achieves more maximum scores than the UCT planner in the test games.
منابع مشابه
Automated planning for pathfinding in real-time strategy games
This thesis is focused on the design of a new path planning algorithm to solve path planning problems in dynamic, partially observable and real-time environments such as Real-Time Strategy (RTS) games. The emphasis is put on fast action selection motivating the use of Monte-Carlo planning techniques. Three main contributions are presented in this thesis. The first contribution is a Monte-Carlo ...
متن کاملMonte Carlo Planning in RTS Games
Monte Carlo simulations have been successfully used in classic turn–based games such as backgammon, bridge, poker, and Scrabble. In this paper, we apply the ideas to the problem of planning in games with imperfect information, stochasticity, and simultaneous moves. The domain we consider is real–time strategy games. We present a framework — MCPlan — for Monte Carlo planning, identify its perfor...
متن کاملUCT for Tactical Assault Planning in Real-Time Strategy Games
We consider the problem of tactical assault planning in real-time strategy games where a team of friendly agents must launch an assault on an enemy. This problem offers many challenges including a highly dynamic and uncertain environment, multiple agents, durative actions, numeric attributes, and different optimization objectives. While the dynamics of this problem are quite complex, it is ofte...
متن کاملA Monte-Carlo Policy Rollout Planner for Pathfinding in Real-Time Strategy (RTS) Games
In this paper, we present a novel Monte-Carlo policy rollout algorithm (called MCRT-GAP) that uses a hybrid of focussed exploration of new actions and exploitation of promising actions to expand the lookahead search from the current state in a Monte-Carlo simulation model. The initial estimates of the action values are computed using a combination of the distance heuristic and a collision estim...
متن کاملA Hierarchical Task Network Planner for Pathfinding in Real-Time Strategy Games
In this paper, we propose an automatic mechanism of Hierarchical Task Networks (HTNs) creation for solving the problem of real-time path planning in Real-Time Strategy (RTS) Games. HTNs are created using an abstraction of the game map. A real-time heuristic search approach called Learning Real-Time A* (LRTA) is applied to execute the primitive tasks of the HTNs. The main purpose of using a HTN ...
متن کامل